The Immersion Conjecture for Rf 8 / + 7 Is False
نویسندگان
چکیده
Let a(n) denote the number of l's in the binary expansion of n. It is proved that if n m 7 (8), a(ri) = 6, and n y= 63, then RP" can be immersed in R2"-14. This provides the first counterexample to the wellknown conjecture that the best immersion is in R2»-2«!")* ' (when a(n) = 1 or 2 mod 4). The method of proof is obstruction theory.
منابع مشابه
On the Necessity of Reidemeister Move 2 for Simplifying Immersed Planar Curves
In 2001, Östlund conjectured that Reidemeister moves 1 and 3 are sufficient to describe a homotopy from any generic immersion S1 → R2 to the standard embedding of the circle. We show that this conjecture is false.
متن کاملImmersing Small Complete Graphs
Following in the spirit of the Hadwiger and Hajós conjectures, AbuKhzam and Langston have conjectured that every k-chromatic graph contains an immersion of Kk. They proved this for k ≤ 4. Here we make the stronger conjecture that every simple graph of minimum degree k−1 contains an immersion ofKk. We prove that this conjecture holds for every k ≤ 7.
متن کاملOn immersions of uncountable graphs
In his paper on well-quasi-ordering infinite trees (Proc. Cambridge Philos. Soc. 61 (1965) 697), Nash-Williams proposed the conjecture that the class of all graphs (finite or infinite) is well-quasi-ordered by the immersion relation (which is denoted here by p1). In addition, in a subsequent paper, Nash-Williams discussed a weaker version of his original conjecture to the effect that the class ...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010